翻訳と辞書 |
Cache-oblivious matrix multiplication : ウィキペディア英語版 | Cache-oblivious matrix multiplication Rectangular matrices can be multiplied when the size of the cache and cache line is not known to the algorithm, or cache-obliviously. Cache-oblivious matrix multiplication was first formalized by Harald Prokop. ==Matrix multiplication== Two matrixes and of size and with a cache of size and cache lines of length can be multiplied with cache misses under the tall cache assumption . and are not known at runtime.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cache-oblivious matrix multiplication」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|